Information-Theoretically Secure Byzantine Paxos
نویسندگان
چکیده
We present Information Theoretically secure Byzantine Paxos (IT ByzPaxos), the first deterministic asynchronous Byzantine consensus protocol that is provably secure despite a computationally unbounded adversary. Previous deterministic asynchronous algorithms for Byzantine consensus rely on unproven number theoretic assumptions (i.e., digital signatures) to maintain agreement. IT ByzPaxos instead uses secret sharing techniques that are information theoretically secure to ensure that all correct processes agree. Our protocol guarantees safety in an asynchronous system and provides progress under eventual synchrony. IT ByzPaxos matches the 3f+1 lower bound on the number of processes for Byzantine consensus.
منابع مشابه
Yet Another Visit to Paxos
This paper presents a modular introduction to crash-tolerant and Byzantine-tolerant protocols for reaching consensus that use the method introduced by the Paxos algorithm of Lamport and by the viewstamped replication algorithm of Oki and Liskov. The consensus protocol runs a sequence of epoch abstractions as governed by an epoch-change abstraction. Implementations of epoch and epoch-change that...
متن کاملOn the Core Mechanisms of Consensus Algorithms for Benign and Byzantine Faults (Preliminary Version)
Consensus is a fundamental and difficult problem in fault tolerant distributed computing, and numerous consensus algorithms have been published. The paper proposes a generic consensus algorithm that highlights, through well chosen parameters, the core mechanisms of a number of well-known consensus algorithms including Paxos, OneThirdRule, PBFT, FaB Paxos. Interestingly, the generic algorithm al...
متن کامل6.857 - Final Project Secure Transactions without Mining or Central Authority
In our project we implemented a system from transferring money without using Proof-of-Work, but consensus algorithms. First we implemented it using Paxos[11], that does not support Byzantine failures and needs a central authority to decide which nodes participate on the agreements. Then we reimplemented it using Stellar Consensus Protocol[2], that has no central authority and allows Byzantine n...
متن کاملMulti-valued Byzantine Broadcast: The t < n Case
Byzantine broadcast is a distributed primitive that allows a specific party to consistently distribute a message among n parties in the presence of potential misbehavior of up to t of the parties. All known protocols implementing broadcast of an `-bit message from point-to-point channels tolerating any t < n Byzantine corruptions have communication complexity at least Ω(`n). In this paper we gi...
متن کاملUsing Paxos For Distributed Agreement
As trends in application development shift away from a classically centralized approach and towards a massively distributed paradigm, the need for efficiently coordinating agreement between distributed application components becomes clear. This paper will provide a historical and technical overview of the Paxos algorithm, which provides a mechanism for achieving consensus between processors. Pa...
متن کامل